a model for specification of cryptographic protocols and its operational interpretation with algebraic methods

logic analysis and attack construction methods are two major approaches in verification of cryptographic protocols. however, it is almost preferable to use both of them for a complete analysis. in this paper, a generic framework for the integration of the two verification approaches is presented. using the framework we can propose analysis methods in which security properties and breach scenarios of the properties in a protocol can be verified in a unified manner. the focus on this paper is on a computational model of the protocols as the major component of the framework. the operational interpretation of the computational model with a term rewriting system (trs) is presented too. to specify an intended protocol, we can represent it as a set of individual steps, and then using a transformation algorithm, a terminated and confluent trs is generated automatically. this trs is used to construct a special representation of the protocol named the protocol execution path, which can be used as the base of various verification schemes. specification and verification of a sample protocol is presented too.